/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;

ll ans;
ll id;

ll findN(ll n)
{
    n |= n >> 1;
    n |= n >> 2;
    n |= n >> 4;
    n |= n >> 8;
    n |= n >> 16; // 整型一般是 32 位，上面我是假设 8 位。
    return (n + 1) >> 1;
}
ll f(ll n)
{
    ll ans = 1;
    while (ans * 2 <= n)
    {
        ans *= 2;
    }
    return ans;
}
void dfs(ll n, ll l, ll r)
{
    if (l > r)
        return;
    if (n == 1)
    {
        ans++;
        return;
    }
    ll mid = findN(n);
    dfs(n / 2, l, min(r, mid - 1));
    dfs(n / 2, max(1ll, l - mid), r - mid);
    if (mid >= l && mid <= r)
        ans += (n % 2);

    return;
}

int main()
{
    IOS;
    ll n, l, r;
    ans = 0;
    cin >> n >> l >> r;
    if (n == 0)
    {
        cout << 0 << endl;
        return 0;
    }
    dfs(n, l, r);
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
